Perfect hash families, identifiable parent property codes and covering arrays
نویسنده
چکیده
منابع مشابه
Improved bounds for separating hash families
An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinator...
متن کاملNew Constructions for IPP Codes
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit construction methods for IPP codes by means of recursion techniques. The first method directly constructs IPP codes, whereas the second constructs perfect hash families that are then used to derive IPP codes. In fact, the fir...
متن کاملNew Constructions for Perfect Hash Families andRelated Structures using Combinatorial
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...
متن کاملThe Stein-Lovász Theorem and Its Applications to Some Combinatorial arrays
The Stein-Lovász Theorem can be used to get existence results for some combinatorial problems using constructive methods rather than probabilistic methods. In this paper, we discuss applications of the Stein-Lovász Theorem to some combinatorial set systems and arrays, including perfect hash families, separating hash families, splitting systems, covering designs, lotto designs and ∆-free systems...
متن کاملHeterogeneous Hash Families and Covering Arrays
A hash family is a collection of N functions from a domain of size k to a range of size w. A function ‘separates’ two elements of the domain if it maps them to distinct elements of the range. A perfect hash family of strength t requires that for every set of t elements of the domain, one of the functions separates every pair of the t. A distributing hash family weakens the requirement so that, ...
متن کامل